#include <bits/stdc++.h>

using namespace std;

const int MAXN = 5e5+10;

int a[MAXN],ans,n;
bool vis[MAXN];

int main(){
	scanf("%d",&n); ans = n;
	for(int i = 1;i <= n;i++) scanf("%d",&a[i]);
	sort(a+1,a+n+1);
	for(int i = n,j = n-1;i >= 1;i--){
		if(vis[i]) continue;
		while(j >= 1 && a[j] * 2 > a[i]) j--;
		if(j >= 1) ans--,vis[j] = 1,j--;
	}
	printf("%d\n",ans);
	return 0;
}
